Methods for equidistant code search in computer package QPlus

نویسندگان

  • Todor Todorov
  • Galina Bogdanova
چکیده

New tools in computer package for coding theory research and studying QPlus are presented. QPlus includes a DLL library package that implements coding theory algorithms. We consider some methods for searching bounds on the size of q-ary equidistant codes by computer methods. Some examples for optimal equidistant codes and constant-weight equidistant codes that have been constructed by computer methods developed in QPlus are described.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the construction of q-ary equidistant codes

The problem of constructing equidistant codes over an alphabet of an arbitrary size q is considered. Some combinatorial constructions and computer-based search methods are presented. All maximal equidistant codes with distances 3 and 4 are found. DOI: 10.1134/S0032946007040023

متن کامل

Factors Affecting Information Search Behavior in Purchasing an Outbound Package Tour: A Thematic Analysis

The present study seeks to examine the factors affecting information search of heads of households in purchasing an outbound package tour. A sample of 60 academics and non-academics in the field of tourism was chosen. Sampling methods were judgmental and snowball sampling. In order to gather data, we used a semi-structured interview.  Thematic analysis was applied for data analysis, and the col...

متن کامل

Good equidistant codes constructed from certain combinatorial designs

An (n,M, d; q) code is called equidistant code if the Hamming distance between any two codewords is d. It was proved that for any equidistant (n,M, d; q) code, d nM(q − 1)/(M − 1)q(= dopt, say). A necessary condition for the existence of an optimal equidistant code is that dopt be an integer. If dopt is not an integer, i.e. the equidistant code is not optimal, then the code with d = dopt is cal...

متن کامل

Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing

Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...

متن کامل

A Novel Hybrid Approach for Email Spam Detection based on Scatter Search Algorithm and K-Nearest Neighbors

Because cyberspace and Internet predominate in the life of users, in addition to business opportunities and time reductions, threats like information theft, penetration into systems, etc. are included in the field of hardware and software. Security is the top priority to prevent a cyber-attack that users should initially be detecting the type of attacks because virtual environments are not moni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009